منابع مشابه
Strong edge-coloring for cubic Halin graphs
A strong edge-coloring of a graph G is a function that assigns to each edge a color such that two edges within distance two apart must receive different colors. The minimum number of colors used in a strong edge-coloring is the strong chromatic index of G. Lih and Liu [14] proved that the strong chromatic index of a cubic Halin graph, other than two special graphs, is 6 or 7. It remains an open...
متن کاملCompetition Numbers of a Kind of Pseudo-Halin Graphs
For any graph G , G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number ( ) k G of a graph G is defined to be the smallest number of such isolated vertices. In general, it is hard to compute the competition number ( ) k G for a graph G and characterizing a graph by its competition number has been one of important research pr...
متن کاملTotal coloring of pseudo-outerplanar graphs
A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this paper, the total coloring conjecture is completely confirmed for pseudoouterplanar graphs. In particular, it is proved that the total chromatic number of every pseudo-...
متن کاملList total coloring of pseudo-outerplanar graphs
A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. It is proved that every pseudo-outerplanar graph with maximum degree ∆ ≥ 5 is totally (∆ + 1)-choosable.
متن کاملBoxicity of Halin graphs
A k-dimensional box is the Cartesian product R1 × R2 × · · · ×Rk where each Ri is a closed interval on the real line. The boxicity of a graph G, denoted as box(G) is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. Halin graphs are the graphs formed by taking a tree with no degree 2 vertex and then connecting its leaves to form a cycle in such ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.07.024